Lines Missing Every Random Point

نویسندگان

  • Jack H. Lutz
  • Neil Lutz
چکیده

This paper proves that there is, in every direction in Euclidean space, a line that misses every computably random point. Our proof of this fact shows that a famous set constructed by Besicovitch in 1964 has computable measure 0.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3D Detection of Power-Transmission Lines in Point Clouds Using Random Forest Method

Inspection of power transmission lines using classic experts based methods suffers from disadvantages such as highel level of time and money consumption. Advent of UAVs and their application in aerial data gathering help to decrease the time and cost promenantly. The purpose of this research is to present an efficient automated method for inspection of power transmission lines based on point c...

متن کامل

Connectivity of Random Nets

The weak connectivity γ of a random net is defined and computed by an approximation method as a function of a, the axone density. It is shown that γ rises rapidly with a, attaining 0.8 of its asymptotic value (unity) for a = 2, where the number of neurons in the net is arbitrarily large. The significance of this parameter is interpreted also in terms of the maximum expected spread of an epidemi...

متن کامل

تحلیل مشاهدات گمشده در مطالعه اثر دوزهای مختلف مکمل ویتامین D بر مقاومت به انسولین در دوران بارداری

Introduction: The aim  of  this  study  was to impute missing data  and  to compare the effect  of  different doses of  vitamin D supplementation on  insulin resistance during  pregnancy. Methods: A clinical trial  study   was done on 104  women  with diabetes and gestational age less than 12 weeks between 1391 and...

متن کامل

Clustering of Data with Missing Entries using Non-convex Fusion Penalties

The presence of missing entries in data often creates challenges for pattern recognition algorithms. Traditional algorithms for clustering data assume that all the feature values are known for every data point. We propose a method to cluster data in the presence of missing information. Unlike conventional clustering techniques where every feature is known for each point, our algorithm can handl...

متن کامل

The Missing Link: Data Analysis with Missing Information

How do you handle missing data? Deletion of those subjects frequently leads to biased outcomes. Mean imputation assumes that non-responders are no different than responders, and can bias variances toward zero. Last observation carried forward methods, while still often used, can cause bias and even induce an apparent treatment effect. Multiple imputation is an improved method to deal with these...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014